Node deployment is one of the important problems in Wireless Sensor Network (WSN). Concerning the problem of energy hole in the process of node employment, a Node Redeployment Based on the Firefly Algorithm (NRBFA) strategy was proposed. Firstly, the k-means algorithm was used to cluster nodes and the redundant nodes were introduced into the sensor network where nodes are randomly deployed. Then, the Firefly Algorithm (FA) was used to move the redundant nodes to share the load of Cluster Heads (CHs) and balance the energy consumption of nodes in the network. Finally, the redundant nodes were updated after finding the target node by reusing the FA. In the proposed strategy, the reduction of moving distances of nodes and the decrease of the network energy consumption were achieved through moving the redundant nodes effectively. Experimental results show that the proposed strategy can alleviate the "energy hole" problem effectively. Compared with the partition node redeployment algorithm based on virtual force, the proposed strategy reduces the complexity of the algorithm, and can better improve the energy efficiency of the network, balance the network load, as well as prolong the network lifetime by nearly 10 times.

To mine the process model including multi-concurrent 2-loops of triangles in incomplete logs, an AlphaMatch algorithm based on extended Alpha algorithm was proposed. Two activities in triangle structure could be correctly matched in 2-loops of triangles by AlphaMatch in the log without repeated activity sequence, thus the process model with multi-concurrent 2-loops of triangles could be mined. Firstly, the activities in 2-loops of triangles were divided into two categories according to the number of activities. Then, a matrix of head and tail position of the activities was constructed to match the two categories and a footprint matrix was constructed to show the relationship between activities. Finally, a large number of experiments were carried out on ProM platform from model correctness, mining efficiency, fitness and precison. Experimental results show that the Petri net model including multi-concurrent 2-loops of triangles can be mined efficiently by the proposed algorithm.

In order to improve the quality and efficiency of railway crew rostering plan arrangement, the problem of crew rostering plan arrangement was abstracted as a Multi-Traveling Salesman Problem (MTSP) with single base and considering mid-way rest, a single-circulation crew rostering plan mathematical model aiming at the smallest rostering period and the most balanced distributed redundant connection time between crew routings was established, and a new amended heuristic ant colony optimization algorithm was proposed aiming at the model. Firstly, a solution space satisfying the spatial-temporal constraints was constructed and the pheromone concentration was set for the crew routing nodes and the continued paths respectively. Then, the amended heuristic information was adopted to make the ants start at the crew routing order and go through all the crew routings. Finally, the optimal crew rostering plan was selected from the different crew rostering schemes. The proposed model and algorithm were tested on the data of the intercity railway from Guangzhou to Shenzhen. The comparison results with the plan arranged by particle swarm optimization show that under the same model conditions, the crew rostering plan arranged by amended heuristic ant colony optimization algorithm has the average monthly man-hour reduced by 8.5%, the rostering period decreased by 9.4%, and the crew overwork rate of 0. The designed model and algorithm can compress the crew rostering cycle, reduce the crew cost, balance the workload, and avoid the overwork of crew.

To improve the accuracy and automation of malware recognition, an Android malware analysis and detection method based on deep learning was proposed. Firstly, the malware texture fingerprint was proposed to reflect the content similarity of malicious code binary files, and 33 types of malware activity vector space were selected to reflect the potential dynamic activities of malicious code. In addition, to improve the accuracy of the classification, the AutoEncoder (AE) and the Softmax classifier were trained combined with the above characteristics. Test results on different data samples showed that the average classification accuracy of the proposed method was up to 94.9% by using Stacked AE (SAE), which is 1.1 percentage points higher than that of Support Vector Machine (SVM). The proposed method can effectively improve the accuracy of malicious code recognition.

To solve the time-consuming problem of group-by aggregation operation in case of data-intense computation, a cache-friendly group-by aggregation method was proposed. In this paper, the group-by aggregation operation was optimized in two aspects. Firstly, designing cache-friendly group-by aggregation algorithm on Supersonic, an open-source and column-oriented query execution engine, to take the full advantage of column-storage on in-memory computation. Secondly, rewriting the algorithm with multi-threads to speed up the query. In this paper, four different parallel aggregation algorithms were put forward, respectively named Shared-Nothing Parallel Group-by Aggregation (NSHPGA) algorithm, Table-Lock Shared-Hash Parallel Group-by Aggregation (TLSHPGA) algorithm, Bucket-Lock Shared-Hash Parallel Group-by Aggregation (BLSHPGA) algorithm and Node-Lock Shared-Hash Parallel Group-by Aggregation (NLSHPGA) algorithm. Through a series of comparison experiment on different group power set and different number of worker threads, NLSHPGA algorithm was proved to have the best performance both on speed-up ratio and concurrency, which achieved 10x speedups on part of queries. Besides, considering Cache miss and memory utilization, the results shows that NSHPGA algorithm is suitable for smaller group power set, which was 8 in the experiment, and when getting larger, NLSHPGA algorithm performs better than NSHPGA algorithm.

When drift-scan CCD shooting the sky where bright stars are in the filed of view, because of the frame transfer feature, the trailing smear will appear throughout the star image. A fast smear trailing elimination algorithm was proposed by analyzing the imaging mechanism. The method firstly decreased the background non-uniformity by fitting the background, then located smear trailing by calculating the mean gray value of every column in star image and comparing the mean gray values before and after fitting, finally eliminated smear trailing by setting the trailing pixel with the mean gray value after fitting. The experimental results show that the smear trailing is removed completely and the mean deviation of background is apparently reduced, moreover the consuming time of this method is only 20% of that of traditional smear elimination method, which proves the validity of the method.

The recognition accuracy rate of traditional Sparse Representation Classification (SRC) algorithm is relatively low under the interference of complex non-face ingredient, large training sample set and high similarity between the training samples. To solve these problems, a novel face recognition algorithm based on Cluster-Sparse of Active Appearance Model (CS-AAM) was proposed. Firstly, Active Appearance Model (AAM) rapidly and accurately locate facial feature points and to get the main information of the face. Secondly, K-means clustering was run on the training sample set, the images with high similarity degree were assigned to a category and the clustering center was calculated. Then, the center was used as atomic to structure over-complete dictionary and do sparse decomposition. Finally, face images were classified and recognized by computing sparse coefficients and reconstruction residuals. The face images with different samples and different dimensions from ORL face database and Extended Yale B face database were tested for comparing CS-AAM with Nearest Neighbor (NN), Support Vector Machine (SVM), Sparse Representation Classification (SRC), and Collaborative Representation Classification (CRC). The recognition rate of CS-AAM algorithm is higher than other algorithms with the same samples or the same dimensions. Under the same dimensions, the recognition rate of CS-AAM is 95.2% when the selected number of samples is 210 on ORL face database; the recognition rate of CS-AAM is 96.8% when the selected number of samples is 600 on Extended Yale B face database. The experimental results demonstrate that the proposed method has higher recognition accuracy rate.

Multiple Kernel Learning and Support Vector Machine (MKL-SVM) was applied to automatic music genre classification to choose the optimal kernel functions for different features, a method of conducting the optimal kernel function combination into the synthetic kernel function by weighting for music genre classification was proposed. Different optimal kernel functions were chosen for different acoustic features by multiple kernel classification learning, the weight of each kernel function in classification was obtained, and the weight of each acoustic feature in the classification of the genre was clarified, which provided a clear and definite result for the analysis and selection of the feature vector in the classification of music genre. The experiments on the dataset of ISMIR 2011 show that, compared with the traditional single kernel support vector machine classification, the accuracy of the proposed music genre automatic classification method based on MKL-SVM is greatly improved by 6.58%. And the proposed method can more clearly reveal the the different features' impacts on music genre classification results, the classification results has also been significantly improved by selecting features with larger effects on classification.

To overcome slow convergence velocity of Particle Swarm Optimization (PSO) which falls into local optimum easily, the paper proposed a new approach, a PSO algorithm using opposition-based learning and adaptive escape. The proposed algorithm divided states of population evolution into normal state and premature state by setting threshold. If popolation is in normal state, standard PSO algorithm was adopted to evolve; otherwise, it falls into "premature", the algorithm with opposition-based learning strategy and adaptive escape was adopted, the individual optimal location generates the opposite solution by opposition-based learning, increases the learning ability of particle, enhances the ability to escape from local optimum, and raises the optimizing rate. Experiments were conducted on 8 classical benchmark functions, the experimental results show that the proposed algorithm has better convergence velocity and precision than classical PSO algorithm, such as Fully Imformed Particle Swarm optimization (FIPS), self-organizing Hierarchical Particle Swarm Optimizer with Time-Varying Acceleration Coefficients (HPSO-TVAC), Comprehensive Learning Particle Swarm Optimizer (CLPSO), Adaptive Particle Swarm Optimization (APSO), Double Center Particle Swarm Optimization (DCPSO) and Particle Swarm Optimization algorithm with Fast convergence and Adaptive escape (FAPSO).

In order to solve the problem of exponential increase of label space, an overlapping community discovery algorithm based on latent feature was proposed. Firstly, a generative model for network including overlapping communities was proposed. And based on the proposed generative model, an optimal object function was presented by maximizing the generative probability of the whole network, which was used to infer the latent features for each node in the network. Next, the network was induced into a bipartite graph, and the lower bound of feature number was analyzed, which was used to optimize the object function. The experiments show that, the proposed overlapping community discovering algorithm can improve the recall greatly while keeping the precision and execution efficiency unchanged, which indicates that the proposed algorithm is effective with the exponential increase of label space.

The standard Particle Swarm Optimization (PSO) suffers from the premature convergence problem and the slow convergence speed problem when solving complex optimal problems, so a Heterogenous PSO with Multi-strategy parallel learning (MHPSO) was presented. Firstly two new learning strategies, named local disturbance learning strategy and Gaussian subspace learning strategy respectively, were proposed to maintain the population's diversity and jump out from the local optima. And an efficient and stable strategy pool was constructed by combing the above two strategies with the existed one (MBB-PSO); Secondly, a simpler and more effective strategy change mechanism was proposed, which could guide particles when to change the learning strategy. The experimental study on a set of classical test functions show that the proposed approach improves the solution accuracy and convergence speed greatly, and has a superior performance in comparison with several other improved PSO algorithms, such as APSO (Adaptive Particle Swarm Optimization).

As standard Particle Swarm Optimization (PSO) algorithm has some shortcomings, such as getting trapped in the local minima, converging slowly and low precision in the late of evolution, a new improved PSO algorithm based on Gaussian disturbance (GDPSO) was proposed. Gaussian disturbance was put into in the personal best positions, which could prevent falling into local minima and improve the convergence speed and accuracy. While keeping the same number of function evaluations, the experiments were conducted on eight well-known benchmark functions with dimension of 30. The experimental results show that the GDPSO algorithm outperforms some recently proposed PSO algorithms in terms of convergence speed and solution accuracy.

Focusing on the characteristics of resource under large-scale, heterogeneous and dynamic environment in cloud computing, a workflow task scheduling algorithm based on resource fuzzy clustering was proposed. After quantizing and normalizing the resource characteristics, this algorithm integrated the theory of clustering to divide the resources based on the workflow task model and the resource model constructed in advance. The cluster with better synthetic performance was chosen firstly in scheduling stage. Therefore, it shortened the matching time between the task and the resource, and improved the scheduling performance. By comparing this algorithm with HEFT (Heterogeneous Earliest Finish Time) and DLS (Dynamic Level Scheduling), the experimental results show that the average SLR (Schedule Length Ratio) of this algorithm was smaller than that of HEFT by 3.4%, the DLS by 9.9%, and the average speedup of this algorithm was faster than that of HEFT by 59%, the DLS by 10.2% with the increase of tasks in a certain range of [0,100]; when the resources were increased in a certain range of [0,100], the average SLR of this algorithm was smaller than that of HEFT by 3.6%, the DLS by 9.7%, and the average speedup of this algorithm was faster than that of HEFT by 4.5%, the DLS by 10.8%. The results indicate that the proposed algorithm realizes the reasonable division of resources, and it surpasses HEFT and DLS algorithms in makespan.

At present, most of the existing certificateless signcryption schemes proven secure are proposed in the random oracle. Concerning the problem that this kind of schemes usually can not construct the corresponding instance in the practical application, a certificateless signcryption scheme was designed in the standard model. By analyzing several certificateless signcryption schemes in the standard model, it was pointed out that they were all insecure. Based on Aus scheme (AU M H, LIU J K, YUEN T H, et al. Practical hierarchical identity based encryption and signature schemes without random oracles. http://eprint.iacr.org/2006/368.pdf), a new proven secure certificateless signcryption scheme was proposed in the standard model by using bilinear pairing technique of elliptic curves. In the end, it is proved that the scheme satisfies indistinguishability against adaptive chosen ciphertext attack and existential unforgeability against adaptive chosen message and identity attack under the complexity assumptions, such as Decisional Bilinear Diffie-Hellman (DBDH) problem. Therefore, the scheme was secure and reliable.

In order to overcome the drawbacks of Particle Swarm Optimization (PSO) that converges slowly at the last stage and easily falls into local minima, this paper proposed a new PSO algorithm with convergence acceleration and adaptive escape (FAPSO) inspired by the Artificial Bee Colony (ABC) algorithm. For each particle, FAPSO conducted two search operations. One was global search and the other was local search. When a particle got stuck, the adaptive escape operator was used to search the particle again. Experiments were conducted on eight classical benchmark functions. The simulation results demonstrate that the proposed approach improves the convergence rate and solution accuracy, when compared with some recently proposed PSO versions, such as CLPSO. Besides, the results of t-test show clear superiority.

The (t,n) threshold ring signature could be generated by any t entities of n entities group on behalf of the whole group, while the actual signers remain anonymous. In order to design the threshold ring signature scheme with constant size, this paper presented an identity-based threshold ring signature scheme without random oracle by using bilinear pairing technique. In the end, the authors prove this scheme satisfy the unconditional signer ambiguity and existential unforgeability against selective identity, selective chosen message attack in terms of the hardness of Diffie-Hellman Inversion （DHI） problem.

Concerning the premature convergence of Particle Swarm Optimization (PSO) algorithm and Shuffled Frog Leaping Algorithm (SFLA), this paper proposed a swarm intelligence optimization algorithm based on the combination of SFLA and PSO. In this algorithm, the whole particle was divided into two equal groups: SFLA and PSO. An information replacement strategy was designed in the process of their iteration: comparing the fitness of PSO with that of SFLA, the worst individual in each subgroup of SFLA would replace some better individuals in PSO when SFLA is better; otherwise, some better individuals in PSO would replace the best individual in each subgroup of SFLA. Meanwhile, a collaborative approach between the two groups was also designed. Since the information replacement strategy could be influenced by the premature convergence problem in PSO, a random disturbance would be given on each particle's best position. The simulation results show that the proposed algorithm can improve the global search ability and convergence speed efficiently. For the complex functions with high-dimension, the algorithm has very good stability.